Gamma deployment problem in grids: hardness and new integer linear programming formulation
نویسندگان
چکیده
منابع مشابه
Integer Linear Programming Formulation of the Generalized Vehicle Routing Problem
The Generalized Vehicle Routing Problem (GVRP) is an extension of the Vehicle Routing Problem (VRP) defined on a graph in which the nodes (customers, vertices) are grouped into a given number of mutually exclusive and exhaustive clusters (nodesets). In this paper, an integer linear programming formulation of the GVRP with O(n 2 ) binary variables and O(n 2 ) constraints is presented. It is show...
متن کاملA New Mixed Integer Linear Programming Formulation for the Maximum Degree Bounded Connected Subgraph Problem
We give a new mixed integer linear programming (MILP) formulation for Maximum Degree Bounded Connected Subgraph Problem (MDBCSP). The proposed MILP formulation is the first in literature with polynomial number of constraints. Therefore, it will be possible to solve optimally much more instances before in a reasonable time.
متن کاملA new mixed integer linear programming formulation for one problem of exploration of online social networks
Enormous global popularity of online social network sites has initiated numerous studies and methods investigating different aspects of their use, so some concepts from network-based studies in optimization theory can be used for research into online networks. In Gajić (2014) are given a several new mixed integer linear programming formulations for first and second problem of exploration of onl...
متن کاملMixed Integer Linear Programming Formulation Techniques
A wide range of problems can be modeled as Mixed Integer Linear Programming (MILP) problems using standard formulation techniques. However, in some cases the resulting MILP can be either too weak or to large to be effectively solved by state of the art solvers. In this survey we review advanced MILP formulation techniques that result in stronger and/or smaller formulations for a wide class of p...
متن کاملInteger programming formulation for convoy movement problem
This paper reports a study of the strategic network problem of routing military convoys between specific origin and destination pairs. Known as the Convoy Movement Problem (CMP), this problem is formulated as an integer linear program. The proposed mathematical model is evaluated on the basis of average number of iterations and average CPU times. LP-based lower bounds and heuristic based upper ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2019
ISSN: 0969-6016,1475-3995
DOI: 10.1111/itor.12759